Schedulability analysis for fault tolerant real-time systems

نویسنده

  • Sasikumar Punnekkat
چکیده

Predictability and fault tolerance are major requirements for complex real-time systems, which are either safety or mission critical. Traditionally fault tolerant techniques were employed to tackle the problem of ensuring correctness in the value domain only. We stress that the fault tolerance requirements and timing constraints are not orthogonal issues as they appear to be, and hence any viable approach must be an integrated one. Fault tolerance in a real-time system implies that the system is able to deliver correct results in a timely manner even in the presence of faults. Techniques employing time redundancy are commonly used for tolerating a wide class of faults such as transient faults. In these systems, it is essential that the exploitation of time redundancy for correctness does not jeopardize the timeliness attribute. Hence scheduling aspects of fault tolerant real-time systems become all the more important. The research work described in this thesis, focuses on the provision of tests for the feasibility analysis of fault tolerant task sets. These feasibility tests are based on fixed priority scheduling theory, and are formulated under various assumptions regarding frequency of fault occurrences and fault recovery strategy. We have analysed the effects of checkpointing schemes with respect to schedulability. Another important issue we addressed is the estimation of the system’s tolerance to perturbations in its timing parameters. Finally, we provide the notion of probabilistic guarantees to account for nondeterminisms. This complementary approach to the normal deterministic analysis of real-time systems, is an effort towards integrating scheduling theory and probabilistic fault models. The results presented in this thesis provide a foundation for employing fixed priority scheduling theory in the analysis of fault tolerant real-time systems. We expect these results will aid the system designers in the development of predictable and fault tolerant real-time systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of checkpointing for schedulability of real-time systems

Checkpointing is a relatively cost effective method for achieving fault tolerance in real-time systems. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. This paper provides exact schedulability tests for fault tolerant task sets under specified failure hypothesis and employing checkpointing to assist in fau...

متن کامل

A New Fault-Tolerant Technique for Improving Schedulability in Multiprocessor Real-time Systems

In real-time systems, tasks have deadlines to be met despite the presence of faults. Primary-Backup (PB) scheme is one of the most common schemes that has been employed for fault-tolerant scheduling of real-time tasks, wherein each task has two versions and the versions are scheduled on two different processors with time exclusion. There have been techniques proposed for improving schedulabilit...

متن کامل

Probabilistic Guarantees for Fault-Tolerant Real-Time Systems

Hard real-time systems are usually required to provide an absolute guarantee that all tasks will execute by their deadlines. In this paper we address fault tolerant hard realtime systems, and introduce the notion of a probabilistic guarantee. Schedulability analysis is used together with sensitivity analysis to establish the maximum fault frequency that a system can tolerate. The fault model is...

متن کامل

Probabilistic Scheduling Guarantees for Fault-Tolerant Real-Time Systems

Hard real-time systems are usually required to provide an absolute guarantee that all tasks will always complete by their deadlines. In this paper we address fault tolerant hard real-time systems, and introduce the notion of a probabilistic guarantee. Schedulability analysis is used together with sensitivity analysis to establish the maximum fault frequency that a system can tolerate. The fault...

متن کامل

Fixed Priority Schedulability Analysis of a Distributed Real-Time Fault Tolerant Architecture

Guillem Bernat, Jose Miro-Julia and Julian Proenza Departament de Ciències Matemàtiques i Informàtica Universitat de les Illes Balears (UIB) Carretera de Valldemossa, Km 7.5 07071 Palma de Mallorca Spain e-mail: fdmigbn0,dmijmj0,[email protected] Abstract This paper takes a distributed fault-tolerant architecture made ofN real-time nodes and introduces schedulability tests for real-time system...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997